Interactive Proofs For Quantum Computations
نویسندگان
چکیده
Making the computation of U|x〉 blind: we use a universal circuit Q, which on input |“U”〉 |x〉 outputs |“U”〉 U|x〉 Fault tolerance: we adapt standard techniques to the QPIP protocol. Care is due since the verifier needs to prepare authenticated states sequentially, due to lack of space. Interactive View of Shor’s Algorithm For N=xy,x≤y decide whether xi=1 P sends x,y: x≤y & xy=N. V accepts if xy=N & xi=1
منابع مشابه
Additive Proofs of Knowledge - A New Notion for Non-Interactive Proofs
This paper has two contributions. Firstly, we describe an efficient Non-Interactive Zero-Knowledge (NIZK) Proof of Knowledge (PoK) protocol using bilinear pairings. The protocol assumes the hardness of the Computational Diffie-Hellman (CDH) problem. The prover does not perform any pairing computations while the verifier performs 3 pairing computations. The protocol can be used for identificatio...
متن کاملArthur and Merlin in a Quantum World
As usual, Arthur does not have a lot of time to spend performing difficult computations, like verifying that various pairs of graphs are not isomorphic and various quantified boolean formulas are true. He’s recently gotten himself a quantum computer, but often it seems not to help—he only has a few quantum algorithms, and Merlin (as obstinate as ever) maintains that there aren’t any other inter...
متن کاملQuantum Fully Homomorphic Encryption with Verification
Fully-homomorphic encryption (FHE) enables computation on encrypted data while maintaining secrecy. Recent research has shown that such schemes exist even for quantum computation. Given the numerous applications of classical FHE (zero-knowledge proofs, secure two-party computation, obfuscation, etc.) it is reasonable to hope that quantum FHE (or QFHE) will lead to many new results in the quantu...
متن کاملInteractive Proofs for BQP via Self-Tested Graph States
Using the measurement-based quantum computation model, we construct interactive proofs with non-communicating quantum provers and a classical verifier. Our construction gives interactive proofs for all languages in BQP with a polynomial number of quantum provers, each of which, in the honest case, performs only a single measurement. In this paper we introduce two main improvements over previous...
متن کاملQuantum Proofs
Quantum information and computation provide a fascinating twist on the notion of proofs in computational complexity theory. For instance, one may consider a quantum computational analogue of the complexity class NP, known as QMA, in which a quantum state plays the role of a proof (also called a certificate or witness), and is checked by a polynomial-time quantum computation. For some problems, ...
متن کامل